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 listJul 12, 2026 15:33Kevin HeaveyKevin HeaveyScore: 3,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:383,89441,939,82131,292,0001,030,0002,117,632
2Jul 12, 2026 15:383,90042,000,25331,349,0001,022,0002,117,632
3Jul 12, 2026 15:383,90341,960,47031,361,0001,039,0002,117,632
4Jul 12, 2026 15:383,90342,040,72631,379,0001,022,0002,117,632
5Jul 12, 2026 15:383,91742,093,73031,488,0001,026,0002,117,632
6Jul 12, 2026 15:383,93042,203,53131,601,0001,020,0002,117,632
7Jul 12, 2026 15:383,93842,322,66631,662,0001,025,0002,117,632
8Jul 12, 2026 15:383,94642,398,17131,732,0001,023,0002,117,632
9Jul 12, 2026 15:383,94642,386,71531,733,0001,024,0002,117,632