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 listMay 25, 2026 00:58Maya RebholzMaya RebholzScore: 15,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 00:5914,988136,605,256123,338,0001,067,0002,113,536
2May 25, 2026 00:5914,989136,423,440123,338,0001,076,0002,113,536
3May 25, 2026 00:5914,991134,037,916123,368,0001,065,0002,113,536
4May 25, 2026 00:5914,997134,684,934122,395,0002,084,0002,113,536
5May 25, 2026 00:5915,007136,987,495123,506,0001,054,0002,113,536
6May 25, 2026 00:5915,013134,052,807123,539,0001,070,0002,113,536
7May 25, 2026 00:5915,039137,095,742123,774,0001,057,0002,113,536
8May 25, 2026 00:5915,047137,157,309123,843,0001,053,0002,113,536
9May 25, 2026 00:5915,049137,153,043123,855,0001,052,0002,113,536