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 25, 2026 01:52Charles CabergsCharles CabergsScore: 17,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 01:5216,944156,726,177138,643,0001,994,0002,375,680
2Apr 25, 2026 01:5216,966158,637,057138,829,0001,997,0002,310,144
3Apr 25, 2026 01:5216,985161,628,852138,983,0001,999,0002,363,392
4Apr 25, 2026 01:5217,004158,075,797140,138,0001,000,0002,310,144
5Apr 25, 2026 01:5217,708165,216,954144,978,0001,999,0002,371,584
6Apr 25, 2026 01:5217,723158,746,029146,102,0001,000,0002,306,048
7Apr 25, 2026 01:5217,726162,013,059146,132,0001,000,0002,375,680
8Apr 25, 2026 01:5217,736162,965,466146,216,0001,001,0002,367,488
9Apr 25, 2026 01:5217,737159,855,671146,223,0001,001,0002,359,296