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 11, 2026 10:41RabenknechtRabenknechtScore: 65,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:4265,344552,451,102541,312,0001,047,0002,113,536
2Aug 11, 2026 10:4265,345552,468,607541,266,0001,102,0002,113,536
3Aug 11, 2026 10:4265,352553,202,206541,371,0001,057,0002,113,536
4Aug 11, 2026 10:4265,355552,435,247541,419,0001,028,0002,113,536
5Aug 11, 2026 10:4265,355552,511,640541,398,0001,051,0002,113,536
6Aug 11, 2026 10:4265,360552,549,989541,448,0001,048,0002,113,536
7Aug 11, 2026 10:4265,364552,646,737541,520,0001,007,0002,113,536
8Aug 11, 2026 10:4265,364553,364,887541,525,0001,003,0002,113,536
9Aug 11, 2026 10:4265,374552,604,876541,508,0001,102,0002,113,536