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 listOct 26, 2026 14:58Magdalena BartczakMagdalena BartczakScore: 521,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2026 14:59521,0284,335,566,0744,261,345,00063,190,0002,113,536
2Oct 26, 2026 14:59521,0974,336,542,3534,260,943,00064,164,0002,113,536
3Oct 26, 2026 14:59521,1004,336,172,0584,262,093,00063,045,0002,113,536
4Oct 26, 2026 14:59521,1804,336,829,0224,261,738,00064,057,0002,113,536
5Oct 26, 2026 14:59521,2344,337,472,0014,262,201,00064,043,0002,113,536
6Oct 26, 2026 14:59521,3464,338,286,7544,263,025,00064,147,0002,113,536
7Oct 26, 2026 14:59521,4714,339,224,2264,265,166,00063,044,0002,113,536
8Oct 26, 2026 14:59521,5104,339,874,5474,265,366,00063,171,0002,113,536
9Oct 26, 2026 14:59525,1014,369,370,2794,295,187,00063,158,0002,113,536