Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 26, 2026 20:44Victor MerckléVictor MerckléScore: 7,069Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:457,03966,753,89157,252,0001,174,0002,113,536
2Aug 26, 2026 20:457,04468,132,37757,310,0001,160,0002,113,536
3Aug 26, 2026 20:457,04766,801,65157,318,0001,173,0002,113,536
4Aug 26, 2026 20:457,05366,760,56957,441,0001,100,0002,113,536
5Aug 26, 2026 20:457,06966,968,48057,648,0001,027,0002,113,536
6Aug 26, 2026 20:457,07067,765,79357,525,0001,161,0002,113,536
7Aug 26, 2026 20:457,30368,855,87859,605,0001,011,0002,113,536
8Aug 26, 2026 20:457,30669,729,72759,572,0001,076,0002,113,536
9Aug 26, 2026 20:457,32869,774,30559,728,0001,097,0002,113,536