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 11, 2026 12:41Sergey SerebryakovSergey SerebryakovScore: 7,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 12:417,08382,090,04757,796,000996,0002,392,064
2Mar 11, 2026 12:417,12788,805,50958,149,0001,002,0002,269,184
3Mar 11, 2026 12:417,14282,602,77357,271,0002,009,0002,392,064
4Mar 11, 2026 12:417,56984,707,61760,825,0001,994,0002,273,280
5Mar 11, 2026 12:417,57082,946,05260,834,0001,994,0002,273,280
6Mar 11, 2026 12:417,57287,891,24961,848,000997,0002,273,280
7Mar 11, 2026 12:417,57686,004,60261,884,000998,0002,396,160
8Mar 11, 2026 12:417,58385,493,07061,940,000999,0002,273,280
9Mar 11, 2026 12:417,60586,983,01762,119,0001,001,0002,273,280
10Mar 11, 2026 12:417,60684,479,48662,131,0001,002,0002,273,280
11Mar 11, 2026 12:417,60786,413,03961,135,0002,004,0002,273,280
12Mar 11, 2026 12:417,63288,997,66663,343,00002,273,280