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 listMar 17, 2026 15:55shartgepettoshartgepettoScore: 8,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:558,52197,714,20766,741,0003,984,0002,416,640
2Mar 17, 2026 15:558,680100,651,34469,041,0003,001,0002,379,776
3Mar 17, 2026 15:558,869101,413,61869,583,0004,033,0002,359,296