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 listJul 19, 2026 01:25Ondřej PolaneckýOndřej PolaneckýScore: 7,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:257,11968,924,47057,937,0001,155,0002,113,536
2Jul 19, 2026 01:257,12268,875,43257,960,0001,156,0002,113,536
3Jul 19, 2026 01:257,12268,884,76657,935,0001,183,0002,113,536
4Jul 19, 2026 01:257,12868,999,09258,018,0001,148,0002,113,536
5Jul 19, 2026 01:257,13069,020,31857,954,0001,228,0002,113,536
6Jul 19, 2026 01:257,13068,950,20558,034,0001,145,0002,113,536
7Jul 19, 2026 01:257,13971,172,74358,102,0001,156,0002,113,536
8Jul 19, 2026 01:257,15469,152,62858,131,0001,248,0002,113,536
9Jul 19, 2026 01:257,16569,876,76758,244,0001,230,0002,113,536