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 listJan 31, 2026 15:06olliecrowolliecrowScore: 7,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 15:066,88488,806,51356,135,0001,002,0002,383,872
2Jan 31, 2026 15:066,88780,763,12054,152,0003,008,0002,453,504
3Jan 31, 2026 15:066,97881,086,26953,921,0003,994,0002,445,312
4Jan 31, 2026 15:067,20385,565,92755,802,0003,985,0002,326,528
5Jan 31, 2026 15:067,22088,133,44657,926,0001,997,0002,420,736
6Jan 31, 2026 15:067,26986,686,43156,310,0004,022,0002,359,296