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 listApr 26, 2026 16:11wnwnScore: 3,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:113,44546,341,59627,576,0001,021,0002,486,272
2Apr 26, 2026 16:113,45546,518,90027,653,0001,024,0002,490,368
3Apr 26, 2026 16:113,45542,762,31927,659,0001,024,0002,330,624
4Apr 26, 2026 16:113,45942,954,50827,688,0001,025,0002,490,368
5Apr 26, 2026 16:113,46842,568,09226,801,0001,985,0002,486,272
6Apr 26, 2026 16:113,48645,965,14126,939,0001,995,0002,486,272
7Apr 26, 2026 16:113,55647,009,61328,498,0001,017,0002,486,272
8Apr 26, 2026 16:113,58043,485,28828,724,000990,0002,482,176
9Apr 26, 2026 16:113,63848,379,96829,197,0001,006,0002,326,528