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 listJul 2, 2026 02:12Victor MerckléVictor MerckléScore: 4,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 02:134,30443,451,79534,621,0001,110,0002,117,632stderr
2Jul 2, 2026 02:134,30843,480,98934,653,0001,106,0002,117,632stderr
3Jul 2, 2026 02:134,31243,968,87634,762,0001,030,0002,117,632stderr
4Jul 2, 2026 02:134,31243,567,71234,683,0001,112,0002,117,632stderr
5Jul 2, 2026 02:134,31843,595,16034,806,0001,041,0002,117,632stderr
6Jul 2, 2026 02:134,32243,628,00734,829,0001,045,0002,117,632stderr
7Jul 2, 2026 02:134,33843,823,34834,953,0001,060,0002,117,632stderr
8Jul 2, 2026 02:134,34043,733,86334,999,0001,025,0002,117,632stderr
9Jul 2, 2026 02:134,37844,237,07235,316,0001,028,0002,117,632stderr