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 8, 2026 07:45Victor MerckléVictor MerckléScore: 9,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:509,52888,258,71961,277,00017,808,0002,117,632stderr
2Sep 8, 2026 07:509,76090,097,37960,561,00020,450,0002,117,632stderr
3Sep 8, 2026 07:509,78889,756,29560,279,00020,968,0002,117,632stderr
4Sep 8, 2026 07:509,82790,023,74760,448,00021,122,0002,117,632stderr
5Sep 8, 2026 07:509,87491,103,25460,684,00021,276,0002,117,632stderr
6Sep 8, 2026 07:509,98791,418,48260,297,00022,603,0002,117,632stderr
7Sep 8, 2026 07:5010,08992,219,49560,294,00023,445,0002,117,632stderr
8Sep 8, 2026 07:5010,36694,512,40760,933,00025,112,0002,117,632stderr
9Sep 8, 2026 07:5010,47595,788,82360,084,00026,860,0002,117,632stderr