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 27, 2026 18:03Victor MerckléVictor MerckléScore: 48,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 18:0445,074382,404,156360,243,00013,877,0002,121,728stderr
2Aug 27, 2026 18:0445,657388,041,020365,276,00013,685,0002,121,728stderr
3Aug 27, 2026 18:0445,730388,999,152365,980,00013,579,0002,121,728stderr
4Aug 27, 2026 18:0448,184408,211,033386,460,00013,471,0002,121,728stderr
5Aug 27, 2026 18:0448,256408,906,753387,085,00013,441,0002,121,728stderr
6Aug 27, 2026 18:0448,723412,700,526390,774,00013,635,0002,121,728stderr
7Aug 27, 2026 18:0449,454419,419,509396,989,00013,480,0002,121,728stderr
8Aug 27, 2026 18:0449,598420,762,541398,226,00013,439,0002,121,728stderr
9Aug 27, 2026 18:0449,793421,565,567399,798,00013,490,0002,121,728stderr