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 7, 2026 10:23wnwnScore: 3,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:243,37343,203,02926,950,0001,053,0002,482,176
2May 7, 2026 10:243,38241,223,19227,014,0001,058,0002,482,176
3May 7, 2026 10:243,39043,422,34827,055,0001,085,0002,486,272
4May 7, 2026 10:243,39444,955,15227,108,0001,066,0002,486,272
5May 7, 2026 10:243,40346,925,85627,151,0001,101,0002,490,368
6May 7, 2026 10:243,48842,753,21627,890,0001,067,0002,486,272
7May 7, 2026 10:243,56742,817,52028,556,0001,056,0002,482,176
8May 7, 2026 10:243,57444,088,14228,566,0001,105,0002,490,368
9May 7, 2026 10:243,59544,071,91728,744,0001,099,0002,486,272