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 listMay 3, 2026 18:55TudyMTudyMScore: 34,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 18:5634,519302,896,382285,506,0001,005,0002,359,296
2May 3, 2026 18:5634,532303,950,351285,609,0001,007,0002,375,680
3May 3, 2026 18:5634,537304,776,858285,656,0001,007,0002,371,584
4May 3, 2026 18:5634,538303,545,940285,668,0001,005,0002,375,680
5May 3, 2026 18:5634,543303,043,693285,705,0001,006,0002,379,776
6May 3, 2026 18:5634,544302,830,876285,718,0001,005,0002,387,968
7May 3, 2026 18:5634,545305,113,025285,721,0001,004,0002,392,064
8May 3, 2026 18:5634,549305,211,781285,734,0001,025,0002,392,064
9May 3, 2026 18:5634,557305,894,443285,819,0001,006,0002,387,968