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 20:06wnwnScore: 6,987Success
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 20:066,14972,229,76148,035,0003,002,0002,510,848
2Feb 18, 2026 20:066,25275,893,99448,898,0002,993,0002,433,024
3Feb 18, 2026 20:066,28473,775,76850,150,0002,006,0002,297,856
4Feb 18, 2026 20:066,98779,881,20753,990,0003,999,0002,449,408
5Feb 18, 2026 20:067,17585,784,52556,528,0003,028,0002,441,216
6Feb 18, 2026 20:067,21281,172,41455,872,0003,990,0002,314,240