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:29Ayush SharmaAyush SharmaScore: 478,267Success
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:29467,78111,314,948,0991,535,474,0002,347,111,0002,301,952
2Feb 9, 2026 19:29478,26711,030,983,3291,531,368,0002,438,246,0002,482,176
3Feb 9, 2026 19:29480,16911,349,491,8881,590,109,0002,395,291,0002,461,696