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 listSep 3, 2026 21:07boop34boop34Score: 12,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:1012,500113,691,249102,715,0001,037,0002,113,536
2Sep 3, 2026 21:1012,526113,913,867102,894,0001,078,0002,113,536
3Sep 3, 2026 21:1012,636114,724,064103,773,0001,106,0002,113,536
4Sep 3, 2026 21:1012,749115,706,876104,744,0001,080,0002,113,536
5Sep 3, 2026 21:1012,861116,549,732105,667,0001,083,0002,117,632
6Sep 3, 2026 21:1012,923117,107,093106,162,0001,102,0002,113,536
7Sep 3, 2026 21:1013,077118,372,506107,280,0001,265,0002,113,536
8Sep 3, 2026 21:1013,157119,064,791108,199,0001,011,0002,113,536
9Sep 3, 2026 21:1014,234128,017,390117,062,0001,086,0002,113,536