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 16, 2026 23:37Victor MerckléVictor MerckléScore: 39,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:3839,188334,883,248324,250,0001,014,0002,117,632stderr
2Sep 16, 2026 23:3839,192335,050,374324,163,0001,137,0002,117,632stderr
3Sep 16, 2026 23:3839,220335,314,963324,450,0001,080,0002,117,632stderr
4Sep 16, 2026 23:3839,230335,497,069324,536,0001,077,0002,117,632stderr
5Sep 16, 2026 23:3839,235335,443,197324,578,0001,076,0002,117,632stderr
6Sep 16, 2026 23:3839,296335,997,715325,050,0001,107,0002,117,632stderr
7Sep 16, 2026 23:3839,314336,164,696325,295,0001,012,0002,117,632stderr
8Sep 16, 2026 23:3839,315336,039,980325,177,0001,139,0002,117,632stderr
9Sep 16, 2026 23:3839,466338,672,301326,448,0001,121,0002,117,632stderr