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 23, 2026 07:44Kevin HeaveyKevin HeaveyScore: 3,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:463,32636,284,22426,496,0001,110,0002,113,536
2Sep 23, 2026 07:463,32936,497,90626,484,0001,148,0002,113,536
3Sep 23, 2026 07:463,33736,567,42026,563,0001,136,0002,113,536
4Sep 23, 2026 07:463,34136,543,55726,724,0001,013,0002,113,536
5Sep 23, 2026 07:463,34736,535,99426,634,0001,152,0002,113,536
6Sep 23, 2026 07:463,37145,327,19626,864,0001,122,0002,113,536
7Sep 23, 2026 07:463,39244,673,92927,041,0001,114,0002,113,536
8Sep 23, 2026 07:463,40737,401,09927,171,0001,113,0002,113,536
9Sep 23, 2026 07:463,42737,297,32927,366,0001,080,0002,113,536