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 listJun 25, 2026 11:20Victor MerckléVictor MerckléScore: 4,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 11:214,36743,848,68335,153,0001,098,0002,113,536
2Jun 25, 2026 11:214,37543,859,97635,232,0001,083,0002,113,536
3Jun 25, 2026 11:214,38143,930,12635,283,0001,083,0002,113,536
4Jun 25, 2026 11:214,38243,950,30735,297,0001,077,0002,113,536
5Jun 25, 2026 11:214,38444,014,72035,293,0001,098,0002,113,536
6Jun 25, 2026 11:214,39243,954,00035,362,0001,096,0002,113,536
7Jun 25, 2026 11:214,41644,228,36335,557,0001,099,0002,113,536
8Jun 25, 2026 11:214,43944,313,59235,821,0001,024,0002,113,536
9Jun 25, 2026 11:214,49944,966,04736,246,0001,097,0002,113,536