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 15, 2026 11:35Daniel MastalerzDaniel MastalerzScore: 10,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 11:3510,648113,187,88987,374,0001,004,0002,400,256
2Feb 15, 2026 11:3510,679112,941,25586,622,0002,014,0002,400,256
3Feb 15, 2026 11:3510,695113,431,41386,773,0001,994,0002,400,256
4Feb 15, 2026 11:3510,866115,893,11687,182,0003,006,0002,289,664
5Feb 15, 2026 11:3510,902114,594,15789,482,0001,005,0002,400,256
6Feb 15, 2026 11:3510,919120,466,31788,612,0002,013,0002,297,856