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 13, 2026 18:51Victor MerckléVictor MerckléScore: 186,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:51186,4751,556,771,3441,546,746,0001,001,0002,117,632stderr
2May 13, 2026 18:51186,5001,557,563,0971,546,796,0001,156,0002,117,632stderr
3May 13, 2026 18:51186,5301,557,029,0541,547,034,0001,171,0002,117,632stderr
4May 13, 2026 18:51186,5531,558,158,7821,547,237,0001,157,0002,117,632stderr
5May 13, 2026 18:51186,5691,557,511,3881,547,388,0001,140,0002,117,632stderr
6May 13, 2026 18:51186,6751,556,968,0331,548,349,0001,057,0002,117,632stderr
7May 13, 2026 18:51187,3081,562,377,2821,552,653,0002,010,0002,117,632stderr
8May 13, 2026 18:51188,3761,574,626,3221,562,423,0001,100,0002,117,632stderr
9May 13, 2026 18:51188,4431,572,497,5151,562,915,0001,168,0002,117,632stderr