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 listJul 31, 2026 23:56George SeabridgeGeorge SeabridgeScore: 10,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 23:5710,82899,977,33588,792,0001,088,0002,113,536
2Jul 31, 2026 23:5710,83099,940,94388,816,0001,074,0002,113,536
3Jul 31, 2026 23:5710,83599,998,31388,854,0001,082,0002,113,536
4Jul 31, 2026 23:5710,848100,062,77688,961,0001,080,0002,113,536
5Jul 31, 2026 23:5710,856100,153,95089,017,0001,090,0002,113,536
6Jul 31, 2026 23:5710,875100,261,23089,260,0001,007,0002,113,536
7Jul 31, 2026 23:5710,896100,462,63089,354,0001,090,0002,113,536
8Jul 31, 2026 23:5710,898100,473,37889,380,0001,074,0002,113,536
9Jul 31, 2026 23:5710,934101,010,18689,674,0001,081,0002,113,536