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 18, 2026 09:57wnwnScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 09:564,26758,458,05834,406,0001,011,0002,498,560
2Mar 18, 2026 09:564,27556,605,64934,471,0001,013,0002,498,560
3Mar 18, 2026 09:564,29162,161,96734,599,0001,017,0002,494,464
4Mar 18, 2026 09:564,29264,977,84134,604,0001,017,0002,273,280
5Mar 18, 2026 09:564,29761,806,04234,647,0001,019,0002,494,464
6Mar 18, 2026 09:574,31959,862,56733,855,0001,991,0002,502,656
7Mar 18, 2026 09:574,31959,958,83133,859,0001,991,0002,490,368
8Mar 18, 2026 09:564,36861,230,49934,242,0002,014,0002,494,464
9Mar 18, 2026 09:574,91666,133,73739,809,000995,0002,273,280