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 5, 2026 14:38flavio87flavio87Score: 38,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:3838,833336,772,819321,155,0001,165,0002,367,488
2May 5, 2026 14:3838,845350,285,745321,413,0001,008,0002,367,488
3May 5, 2026 14:3838,858339,216,601321,418,0001,108,0002,371,584
4May 5, 2026 14:3838,863340,145,994321,566,0001,004,0002,371,584
5May 5, 2026 14:3838,875351,939,356321,654,0001,016,0002,355,200
6May 5, 2026 14:3838,877342,588,615321,633,0001,047,0002,355,200
7May 5, 2026 14:3838,879349,477,116321,506,0001,194,0002,363,392
8May 5, 2026 14:3838,900353,008,675321,848,0001,028,0002,347,008
9May 5, 2026 14:3838,925355,007,152321,999,0001,080,0002,301,952