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 7, 2026 03:53Victor MerckléVictor MerckléScore: 4,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:544,72547,245,76338,174,0001,046,0002,117,632stderr
2Jul 7, 2026 03:544,73147,237,37438,226,0001,045,0002,117,632stderr
3Jul 7, 2026 03:544,74347,753,89538,249,0001,123,0002,117,632stderr
4Jul 7, 2026 03:544,74447,445,30738,244,0001,138,0002,117,632stderr
5Jul 7, 2026 03:544,74647,687,73838,261,0001,139,0002,117,632stderr
6Jul 7, 2026 03:544,74947,516,43338,309,0001,112,0002,117,632stderr
7Jul 7, 2026 03:544,75247,538,58638,320,0001,122,0002,117,632stderr
8Jul 7, 2026 03:544,75447,519,93038,338,0001,121,0002,117,632stderr
9Jul 7, 2026 03:544,75949,561,65738,371,0001,133,0002,117,632stderr