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 13, 2026 03:42olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:17Yuriy Lyfenko14.38CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:18019,075,3850991,000409,600Exit with code 1:
2Mar 13, 2026 03:422,31335,670,92219,194,00002,506,752
3Mar 13, 2026 03:422,31743,270,55319,227,00002,273,280
4Mar 13, 2026 03:422,31944,487,45019,248,00002,506,752
5Mar 13, 2026 03:422,31940,148,32719,251,00002,273,280
6Mar 13, 2026 03:422,31936,660,61019,251,00002,273,280
7Mar 13, 2026 03:422,32040,106,21619,260,00002,273,280
8Mar 13, 2026 03:422,32135,517,25119,265,00002,273,280
9Mar 13, 2026 03:422,32345,227,76919,282,00002,506,752
10Mar 13, 2026 03:422,32442,098,50319,291,00002,273,280