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 listAug 28, 2026 21:17Victor MerckléVictor MerckléScore: 5,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:175,15351,777,94141,753,0001,019,0002,117,632stderr
2Aug 28, 2026 21:175,15351,865,43141,751,0001,019,0002,117,632stderr
3Aug 28, 2026 21:175,16351,914,69041,842,0001,019,0002,117,632stderr
4Aug 28, 2026 21:175,17951,322,61541,949,0001,042,0002,117,632stderr
5Aug 28, 2026 21:175,18952,142,83642,055,0001,019,0002,117,632stderr
6Aug 28, 2026 21:175,19652,209,63242,111,0001,020,0002,117,632stderr
7Aug 28, 2026 21:175,22052,363,87542,303,0001,028,0002,117,632stderr
8Aug 28, 2026 21:175,23151,511,60142,401,0001,020,0002,117,632stderr
9Aug 28, 2026 21:175,25252,617,80942,561,0001,038,0002,117,632stderr