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 4, 2026 12:21limanjun99limanjun99Score: 4,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 12:224,33051,481,61733,667,0002,278,0002,502,656
2May 4, 2026 12:224,35954,281,97133,900,0002,287,0002,506,752
3May 4, 2026 12:224,39152,281,38933,325,0003,124,0002,498,560
4May 4, 2026 12:224,39952,111,45334,267,0002,252,0002,498,560
5May 4, 2026 12:224,42353,371,04833,351,0003,361,0002,506,752
6May 4, 2026 12:224,44755,751,84034,631,0002,285,0002,494,464
7May 4, 2026 12:224,45253,970,32433,428,0003,531,0002,510,848
8May 4, 2026 12:224,52256,053,65135,261,0002,276,0002,506,752
9May 4, 2026 12:224,53054,606,23734,179,0003,421,0002,498,560