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 listMar 8, 2026 19:16wnwnScore: 4,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 19:174,37155,919,43435,276,0001,007,0002,273,280
2Mar 8, 2026 19:174,37756,826,02535,320,0001,009,0002,273,280
3Mar 8, 2026 19:164,38656,746,41835,394,0001,011,0002,494,464
4Mar 8, 2026 19:164,39160,555,46535,431,0001,012,0002,498,560
5Mar 8, 2026 19:174,39958,900,15035,499,0001,014,0002,494,464
6Mar 8, 2026 19:164,41170,545,30935,593,0001,016,0002,273,280
7Mar 8, 2026 19:174,41865,266,42335,655,0001,018,0002,494,464
8Mar 8, 2026 19:174,44164,165,33834,868,0001,992,0002,490,368
9Mar 8, 2026 19:174,46057,101,73835,014,0002,000,0002,531,328