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 listSep 2, 2026 12:19Victor MerckléVictor MerckléScore: 3,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 12:193,77539,756,32130,267,0001,069,0002,117,632stderr
2Sep 2, 2026 12:193,92341,445,89331,495,0001,069,0002,117,632stderr
3Sep 2, 2026 12:193,94541,252,06731,607,0001,141,0002,117,632stderr
4Sep 2, 2026 12:193,95241,194,53231,755,0001,054,0002,117,632stderr
5Sep 2, 2026 12:193,96741,359,84131,881,0001,051,0002,117,632stderr
6Sep 2, 2026 12:193,98741,503,32031,985,0001,115,0002,117,632stderr
7Sep 2, 2026 12:193,98741,489,17432,053,0001,047,0002,117,632stderr
8Sep 2, 2026 12:193,98841,630,38732,050,0001,052,0002,117,632stderr
9Sep 2, 2026 12:194,08542,329,04032,857,0001,052,0002,117,632stderr