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 26, 2026 20:21Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:49Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:51049,025,55738,274,0001,016,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
2Jul 7, 2026 21:51049,769,47839,087,0001,018,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
3Jul 7, 2026 21:51048,971,53038,243,0001,015,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
4Feb 26, 2026 20:215,15871,510,53439,824,0002,986,0002,289,664
5Feb 26, 2026 20:215,16268,037,00839,854,0002,989,0002,400,256
6Feb 26, 2026 20:215,17467,391,06639,949,0002,996,0002,281,472