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 listApr 24, 2026 13:44TudyMTudyMScore: 89,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 13:4489,380758,458,918684,873,00056,989,0002,367,488
2Apr 24, 2026 13:4489,398760,692,513681,004,00061,000,0002,363,392
3Apr 24, 2026 13:4489,445761,985,527686,368,00056,030,0002,322,432