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 listMar 10, 2026 17:40Sergey SerebryakovSergey SerebryakovScore: 8,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:408,12689,357,75566,438,0001,006,0002,273,280
2Mar 10, 2026 17:408,14494,956,23766,589,0001,008,0002,273,280
3Mar 10, 2026 17:408,23488,797,55167,336,0001,005,0002,273,280
4Mar 10, 2026 17:408,946100,435,55872,249,0002,006,0002,392,064
5Mar 10, 2026 17:409,03898,879,10575,012,00002,396,160
6Mar 10, 2026 17:409,03999,371,07673,024,0002,000,0002,273,280