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 9, 2026 20:34wnwnScore: 4,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 20:354,32457,137,96633,894,0001,993,0002,273,280
2Mar 9, 2026 20:344,34359,412,91634,048,0002,002,0002,494,464
3Mar 9, 2026 20:344,35269,420,15334,115,0002,006,0002,273,280
4Mar 9, 2026 20:354,36462,969,55634,207,0002,012,0002,273,280
5Mar 9, 2026 20:354,37655,424,49835,311,0001,008,0002,527,232
6Mar 9, 2026 20:344,86261,769,18139,344,0001,008,0002,490,368