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 11, 2026 12:56Victor MerckléVictor MerckléScore: 3,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:563,88740,574,25131,152,0001,113,0002,117,632stderr
2Aug 11, 2026 12:563,88740,532,95531,079,0001,191,0002,117,632stderr
3Aug 11, 2026 12:563,90140,594,34231,273,0001,106,0002,117,632stderr
4Aug 11, 2026 12:563,91640,708,81731,299,0001,210,0002,117,632stderr
5Aug 11, 2026 12:563,93040,798,24931,508,0001,111,0002,117,632stderr
6Aug 11, 2026 12:563,94742,252,13231,552,0001,214,0002,117,632stderr
7Aug 11, 2026 12:563,95241,086,71231,691,0001,117,0002,117,632stderr
8Aug 11, 2026 12:564,02441,629,09032,222,0001,182,0002,117,632stderr
9Aug 11, 2026 12:564,30344,045,86934,554,0001,164,0002,117,632stderr