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

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:09Yuriy Lyfenko357.65CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 11:50016,447,6309,064,0002,014,0002,265,088expected "53680084681984704 ", got "53690925497344944 "
2Apr 21, 2026 18:10021,302,3440951,000409,600Exit with code 1:
3Mar 13, 2026 06:551,19426,896,7378,921,000991,0002,269,184
4Mar 13, 2026 06:551,19624,872,1438,934,000992,0002,375,680
5Mar 13, 2026 06:551,19626,728,0778,934,000992,0002,531,328
6Mar 13, 2026 06:551,19629,491,7637,944,0001,986,0002,531,328
7Mar 13, 2026 06:551,19630,255,5218,937,000993,0002,273,280
8Mar 13, 2026 06:551,20120,891,6198,973,000997,0002,273,280
9Mar 13, 2026 06:551,20232,348,2338,982,000998,0002,273,280
10Mar 13, 2026 06:551,20625,188,1139,012,0001,001,0002,273,280
11Mar 13, 2026 06:551,20925,828,7718,025,0002,006,0002,367,488