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 18, 2026 18:40wnwnScore: 7,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:406,26975,749,75351,034,0001,000,0002,498,560
2Feb 18, 2026 18:406,29680,179,44849,241,0003,014,0002,510,848
3Feb 18, 2026 18:406,39776,876,63951,093,0002,003,0002,531,328
4Feb 18, 2026 18:407,15985,248,64255,390,0004,028,0002,420,736
5Feb 18, 2026 18:407,20588,872,52057,812,0001,993,0002,400,256
6Feb 18, 2026 18:407,20785,712,15057,827,0001,994,0002,412,544