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 23, 2026 21:36Daniel MastalerzDaniel MastalerzScore: 5,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:365,62171,564,94044,630,0002,028,0002,285,568
2Feb 23, 2026 21:365,66169,856,01345,985,000999,0002,285,568
3Feb 23, 2026 21:365,71774,311,17145,433,0002,019,0002,490,368
4Feb 23, 2026 21:365,71970,571,94745,446,0002,019,0002,322,432
5Feb 23, 2026 21:365,75079,439,48745,739,0001,988,0002,281,472
6Feb 23, 2026 21:365,84370,770,28747,483,0001,010,0002,285,568