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 listApr 24, 2026 08:30olliecrowolliecrowScore: 6,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:306,25370,191,82148,909,0002,994,0002,519,040
2Apr 24, 2026 08:306,28471,661,80451,162,0001,003,0002,560,000
3Apr 24, 2026 08:306,30570,164,13449,318,0003,019,0002,461,696
4Apr 24, 2026 08:306,32669,679,94748,472,0004,039,0002,445,312
5Apr 24, 2026 08:306,36468,494,84450,834,0001,993,0002,465,792
6Apr 24, 2026 08:306,50265,953,97850,973,0002,998,0002,306,048
7Apr 24, 2026 08:306,60369,844,07250,750,0004,060,0002,453,504
8Apr 24, 2026 08:306,66069,102,77551,188,0004,095,0002,371,584
9Apr 24, 2026 08:306,69873,205,69153,574,0002,021,0002,473,984