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 listFeb 21, 2026 22:32Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 61,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 22:3261,253534,572,602507,401,0001,000,0002,289,664
2Feb 21, 2026 22:3261,272537,034,813506,563,0001,998,0002,289,664
3Feb 21, 2026 22:3261,278536,012,098506,607,0001,998,0002,527,232
4Feb 21, 2026 22:3261,279534,321,882507,614,000999,0002,527,232
5Feb 21, 2026 22:3261,289530,763,448506,700,0001,998,0002,273,280
6Feb 21, 2026 22:3261,289537,461,000507,696,000999,0002,281,472
7Feb 21, 2026 22:3261,299532,663,269507,782,000999,0002,281,472
8Feb 21, 2026 22:3261,299535,548,613506,781,0001,999,0002,289,664
9Feb 21, 2026 22:3261,339534,599,073507,113,0002,000,0002,281,472