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 12, 2026 02:02Victor MerckléVictor MerckléScore: 3,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 02:033,75539,577,78030,072,0001,102,0002,117,632stderr
2Aug 12, 2026 02:033,75839,629,26930,067,0001,132,0002,117,632stderr
3Aug 12, 2026 02:033,76139,993,98930,064,0001,158,0002,117,632stderr
4Aug 12, 2026 02:033,76939,737,82630,152,0001,137,0002,117,632stderr
5Aug 12, 2026 02:033,78039,944,84330,258,0001,116,0002,117,632stderr
6Aug 12, 2026 02:033,79939,953,53230,389,0001,150,0002,117,632stderr
7Aug 12, 2026 02:033,83040,802,85930,674,0001,121,0002,117,632stderr
8Aug 12, 2026 02:033,83440,269,98430,691,0001,139,0002,117,632stderr
9Aug 12, 2026 02:033,84040,243,88330,781,0001,091,0002,117,632stderr