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 23, 2026 20:29Elijah KinElijah KinScore: 65,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 20:2965,029564,231,060538,742,000999,0002,523,136
2Mar 23, 2026 20:2965,378572,800,504540,638,0001,998,0002,519,040
3Mar 23, 2026 20:2965,423575,414,662543,012,00002,265,088