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 20, 2026 16:25Daniel MastalerzDaniel MastalerzScore: 5,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:255,73275,786,21645,551,0002,024,0002,326,528
2Feb 20, 2026 16:255,76079,140,56443,825,0003,984,0002,330,624
3Feb 20, 2026 16:255,83767,751,18445,419,0003,027,0002,265,088
4Feb 20, 2026 16:255,85174,896,93846,539,0002,023,0002,306,048
5Feb 20, 2026 16:255,85176,532,11545,529,0003,035,0002,273,280
6Feb 20, 2026 16:255,89280,578,86645,908,0002,994,0002,273,280