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:52olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:19Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:20019,504,21801,007,000401,408Exit with code 1:
2Mar 13, 2026 03:522,31643,026,79619,220,00002,273,280
3Mar 13, 2026 03:522,31644,518,91119,224,00002,273,280
4Mar 13, 2026 03:522,31845,028,52019,238,00002,273,280
5Mar 13, 2026 03:522,32043,106,03919,252,00002,273,280
6Mar 13, 2026 03:522,32040,686,26419,254,00002,273,280
7Mar 13, 2026 03:522,32146,731,34119,261,00002,502,656
8Mar 13, 2026 03:522,32244,017,73219,271,00002,502,656
9Mar 13, 2026 03:522,32345,528,60219,280,00002,531,328
10Mar 13, 2026 03:522,32441,924,55519,289,00002,273,280