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 listNov 1, 2026 19:04Dinu GoyalDinu GoyalScore: 55,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:0455,299469,596,441457,879,0001,104,0002,113,536
2Nov 1, 2026 19:0455,316470,285,363457,921,0001,202,0002,113,536
3Nov 1, 2026 19:0455,415470,615,046458,854,0001,097,0002,113,536
4Nov 1, 2026 19:0455,636472,699,586460,588,0001,196,0002,113,536
5Nov 1, 2026 19:0455,643472,459,239460,743,0001,100,0002,113,536
6Nov 1, 2026 19:0456,649480,780,680469,007,0001,182,0002,113,536
7Nov 1, 2026 19:0456,701481,378,291469,440,0001,186,0002,113,536
8Nov 1, 2026 19:0456,755481,832,341470,045,0001,028,0002,113,536
9Nov 1, 2026 19:0456,766482,444,686470,158,0001,001,0002,113,536