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 listFeb 14, 2026 09:02Daniel MastalerzDaniel MastalerzScore: 6,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 09:026,44576,259,89850,465,0003,027,0002,269,184
2Feb 14, 2026 09:026,45386,017,13650,528,0003,031,0002,519,040
3Feb 14, 2026 09:026,47484,034,90150,752,0002,985,0002,273,280
4Feb 14, 2026 09:026,47876,649,65349,785,0003,982,0002,367,488
5Feb 14, 2026 09:026,47983,471,43749,796,0003,983,0002,269,184
6Feb 14, 2026 09:026,48080,720,61049,802,0003,984,0002,306,048
7Feb 14, 2026 09:026,48578,864,99850,782,0003,046,0002,519,040
8Feb 14, 2026 09:026,49976,709,58050,942,0002,996,0002,326,528
9Feb 14, 2026 09:026,50681,041,27350,999,0002,999,0002,326,528
10Feb 14, 2026 09:026,60281,696,28851,805,0002,988,0002,289,664
11Feb 14, 2026 09:026,60281,234,59751,805,0002,988,0002,510,848
12Feb 14, 2026 09:026,60480,025,03851,823,0002,989,0002,318,336