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 15:03Daniel MastalerzDaniel MastalerzScore: 13,871Success
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 15:0313,860137,398,146113,034,0002,000,0002,392,064
2Feb 7, 2026 15:0313,865139,796,679114,079,0001,000,0002,277,376
3Feb 7, 2026 15:0313,870137,324,095113,122,0002,002,0002,392,064
4Feb 7, 2026 15:0313,871140,210,168114,127,0001,001,0002,400,256
5Feb 7, 2026 15:0313,871136,880,173114,131,0001,001,0002,387,968
6Feb 7, 2026 15:0313,873137,940,690114,142,0001,001,0002,277,376
7Feb 7, 2026 15:0313,915140,813,735114,491,0001,004,0002,277,376
8Feb 7, 2026 15:0313,923141,335,308113,548,0002,009,0002,277,376
9Feb 7, 2026 15:0313,946143,681,328114,753,000997,0002,277,376