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 27, 2026 13:33Genos0Genos0Score: 73,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3373,761636,479,078542,305,00069,910,0002,465,792
2Feb 27, 2026 13:3373,893642,797,633544,390,00068,922,0002,342,912
3Feb 27, 2026 13:3374,537643,389,598544,701,00073,959,0002,355,200