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:22Benn TanBenn TanScore: 22,108Success
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:2222,056211,034,746180,064,0003,001,0002,281,472
2Feb 7, 2026 17:2222,090206,569,763183,344,00002,281,472
3Feb 7, 2026 17:2222,100210,127,266182,432,0001,002,0002,281,472
4Feb 7, 2026 17:2222,101207,676,188182,433,0001,002,0002,281,472
5Feb 7, 2026 17:2222,108210,515,166182,496,0001,002,0002,281,472
6Feb 7, 2026 17:2222,110212,329,044182,508,0001,002,0002,281,472
7Feb 7, 2026 17:2222,118211,330,827182,576,0001,003,0002,482,176
8Feb 7, 2026 17:2222,137214,431,872181,736,0001,997,0002,281,472
9Feb 7, 2026 17:2222,140214,804,029182,762,000998,0002,281,472