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 listOct 20, 2026 14:33Anchen0823Anchen0823Score: 58,481Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein17.10CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 14:3358,479496,190,740426,694,00058,686,0002,113,536
2Oct 20, 2026 14:3358,481496,125,315426,377,00059,016,0002,113,536
3Oct 20, 2026 14:3358,517496,552,806426,658,00059,041,0002,113,536