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 7, 2026 17:34Benn TanBenn TanScore: 18,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:3418,712180,339,098151,299,0004,007,0002,478,080
2Feb 7, 2026 17:3418,715178,203,601154,336,0001,002,0002,281,472
3Feb 7, 2026 17:3418,722177,569,840154,391,0001,002,0002,281,472
4Feb 7, 2026 17:3418,725182,035,790155,414,00002,465,792
5Feb 7, 2026 17:3418,743183,763,347154,565,0001,003,0002,281,472
6Feb 7, 2026 17:3418,769185,545,914154,785,000998,0002,281,472
7Feb 7, 2026 17:3418,782185,898,184151,897,0003,997,0002,281,472
8Feb 7, 2026 17:3418,785185,897,589150,918,0004,997,0002,281,472
9Feb 7, 2026 17:3418,863188,424,025153,550,0003,010,0002,281,472