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 listAug 21, 2026 00:15Andrew EpsteinAndrew EpsteinScore: 6,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 00:166,03259,828,14848,938,0001,131,0002,113,536
2Aug 21, 2026 00:166,04159,972,87349,016,0001,129,0002,113,536
3Aug 21, 2026 00:166,07560,265,42949,324,0001,106,0002,113,536
4Aug 21, 2026 00:166,12360,713,89449,702,0001,126,0002,113,536
5Aug 21, 2026 00:166,12360,606,23649,701,0001,123,0002,113,536
6Aug 21, 2026 00:166,12960,646,37049,748,0001,125,0002,113,536
7Aug 21, 2026 00:166,13560,718,48649,802,0001,120,0002,113,536
8Aug 21, 2026 00:166,21262,697,56550,436,0001,130,0002,113,536
9Aug 21, 2026 00:166,26161,758,38950,956,0001,011,0002,113,536