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 11, 2026 19:10olliecrowolliecrowScore: 6,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:105,88175,001,67743,834,0004,981,0002,412,544
2Feb 11, 2026 19:105,91076,691,81544,050,0005,005,0002,433,024
3Feb 11, 2026 19:105,93074,567,97445,205,0004,018,0002,506,752
4Feb 11, 2026 19:106,29779,351,62948,245,0004,020,0002,457,600
5Feb 11, 2026 19:106,33082,987,76247,485,0005,051,0002,351,104
6Feb 11, 2026 19:106,48486,355,49850,831,0002,990,0002,510,848