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 15, 2026 14:17shartgepettoshartgepettoScore: 14,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:1714,937146,890,437111,980,00011,997,0002,469,888
2Mar 15, 2026 14:1714,939152,681,855110,992,00012,999,0002,351,104
3Mar 15, 2026 14:1714,943152,763,731114,025,00010,002,0002,519,040
4Mar 15, 2026 14:1714,956146,678,687114,123,00010,010,0002,461,696
5Mar 15, 2026 14:1714,977149,072,926111,276,00013,032,0002,404,352
6Mar 15, 2026 14:1715,074154,990,332112,103,00013,011,0002,453,504
7Mar 15, 2026 14:1715,269148,996,981114,758,00011,974,0002,334,720
8Mar 15, 2026 14:1715,277151,706,944116,815,0009,984,0002,318,336
9Mar 15, 2026 14:1715,398151,843,890113,827,00013,978,0002,469,888