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 14, 2026 22:51Ondřej PolaneckýOndřej PolaneckýScore: 20,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:5120,102189,737,634164,848,0001,998,0002,277,376
2Mar 14, 2026 22:5120,103193,618,526164,855,0001,998,0002,277,376
3Mar 14, 2026 22:5120,261188,767,387166,167,0002,002,0002,277,376
4Mar 14, 2026 22:5120,575192,650,199169,769,0001,004,0002,277,376
5Mar 14, 2026 22:5120,769193,464,859170,382,0002,004,0002,273,280
6Mar 14, 2026 22:5120,774195,436,864170,420,0002,004,0002,269,184
7Mar 14, 2026 22:5120,786201,691,960172,526,00002,277,376
8Mar 14, 2026 22:5120,793198,870,861170,588,0001,995,0002,277,376
9Mar 14, 2026 22:5120,796200,960,545170,614,0001,995,0002,273,280