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 10, 2026 13:58Oleg SkinderevOleg SkinderevScore: 72,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 13:5872,255622,151,031548,744,00050,976,0002,326,528
2Apr 10, 2026 13:5872,289620,701,697550,998,00048,999,0002,281,472
3Apr 10, 2026 13:5872,300619,137,727545,083,00055,008,0002,322,432
4Apr 10, 2026 13:5872,327623,027,802550,285,00050,025,0002,281,472
5Apr 10, 2026 13:5872,331628,148,693541,317,00059,034,0002,273,280
6Apr 10, 2026 13:5872,356632,695,232538,600,00061,954,0002,273,280
7Apr 10, 2026 13:5872,358625,122,811545,610,00054,960,0002,273,280
8Apr 10, 2026 13:5872,581625,834,952548,478,00053,948,0002,322,432
9Apr 10, 2026 13:5872,623625,006,534543,797,00058,978,0002,281,472