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 listFeb 19, 2026 19:14wnwnScore: 5,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:145,11963,116,61140,465,0002,023,0002,531,328
2Feb 19, 2026 19:145,13668,017,86642,631,00002,273,280
3Feb 19, 2026 19:145,15867,990,10641,813,000995,0002,441,216
4Feb 19, 2026 19:145,15971,865,58340,830,0001,991,0002,441,216
5Feb 19, 2026 19:145,15968,565,93241,802,0001,019,0002,535,424
6Feb 19, 2026 19:145,15971,520,92742,822,00002,445,312
7Feb 19, 2026 19:145,16067,190,06640,834,0001,991,0002,277,376
8Feb 19, 2026 19:145,17367,124,28639,939,0002,995,0002,441,216
9Feb 19, 2026 19:145,17469,571,70740,949,0001,997,0002,273,280
10Feb 19, 2026 19:145,18266,216,84242,010,0001,000,0002,437,120
11Feb 19, 2026 19:145,22765,197,53642,379,0001,009,0002,277,376
12Feb 19, 2026 19:145,23567,016,21642,444,0001,010,0002,445,312