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 20, 2026 12:49Dominique GarmierDominique GarmierScore: 90,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:4988,940765,631,085735,206,0002,996,0002,461,696
2Mar 20, 2026 12:4990,190773,706,378746,583,0001,998,0002,392,064
3Mar 20, 2026 12:4990,294775,333,043747,446,0001,998,0002,461,696