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 24, 2026 20:09olliecrowolliecrowScore: 19,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 20:1218,976165,816,721156,497,0001,009,0002,424,832
2Apr 24, 2026 20:1219,350167,897,964155,561,0005,050,0002,523,136
3Apr 24, 2026 20:1219,354168,942,214157,629,0003,012,0002,355,200
4Apr 24, 2026 20:1219,390169,044,887155,943,0004,998,0002,498,560
5Apr 24, 2026 20:1219,504169,259,336157,891,0003,997,0002,437,120
6Apr 24, 2026 20:1219,546178,356,516157,225,0005,007,0002,568,192
7Apr 24, 2026 20:1219,750172,075,993156,934,0006,997,0002,506,752
8Apr 24, 2026 20:1219,811172,630,821161,425,0003,007,0002,420,736
9Apr 24, 2026 20:1221,426186,090,893172,846,0004,995,0002,465,792