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 29, 2026 13:04Danylo MocherniukDanylo MocherniukScore: 20,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:0419,993198,769,647162,942,0002,998,0002,281,472
2Mar 29, 2026 13:0420,483199,318,990167,005,0003,000,0002,281,472
3Mar 29, 2026 13:0420,492196,084,878166,084,0004,002,0002,281,472
4Mar 29, 2026 13:0420,496194,310,090167,134,0002,984,0002,498,560
5Mar 29, 2026 13:0420,517190,728,970168,284,0002,003,0002,281,472
6Mar 29, 2026 13:0420,524194,665,280166,339,0004,008,0002,498,560
7Mar 29, 2026 13:0420,524200,968,767168,349,0002,004,0002,281,472
8Mar 29, 2026 13:0420,623199,302,314169,169,0002,002,0002,351,104
9Mar 29, 2026 13:0420,650194,244,129170,395,0001,002,0002,281,472