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 listFeb 9, 2026 19:07Ayush SharmaAyush SharmaScore: 175,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 19:07175,2951,479,182,5081,211,128,000243,824,0002,289,664
2Feb 9, 2026 19:07175,3591,489,802,2641,210,737,000244,744,0002,441,216
3Feb 9, 2026 19:07175,7451,491,921,6891,211,907,000246,777,0002,285,568