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 19, 2026 22:09Daniel MastalerzDaniel MastalerzScore: 5,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:095,76076,245,52844,819,0002,987,0002,330,624
2Feb 19, 2026 22:095,78173,494,34044,986,0002,999,0002,306,048
3Feb 19, 2026 22:095,81369,028,20144,229,0004,020,0002,273,280
4Feb 19, 2026 22:095,81977,952,73944,274,0004,024,0002,260,992
5Feb 19, 2026 22:095,84472,024,39745,478,0003,031,0002,260,992
6Feb 19, 2026 22:095,87778,139,64345,797,0002,986,0002,322,432