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 listApr 27, 2026 18:50Charles CabergsCharles CabergsScore: 13,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 18:5013,210127,312,401108,644,0001,005,0002,371,584
2Apr 27, 2026 18:5013,234130,519,140107,849,0001,997,0002,363,392
3Apr 27, 2026 18:5013,562127,532,441111,564,0001,005,0002,363,392
4Apr 27, 2026 18:5013,568130,985,578110,628,0001,993,0002,367,488
5Apr 27, 2026 18:5013,580130,328,264111,712,0001,006,0002,363,392
6Apr 27, 2026 18:5013,582130,007,684110,740,0001,995,0002,371,584
7Apr 27, 2026 18:5013,586133,298,031110,776,0001,995,0002,363,392
8Apr 27, 2026 18:5013,593128,350,697110,829,0001,996,0002,367,488
9Apr 27, 2026 18:5013,601131,522,710110,891,0001,998,0002,363,392