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 19, 2026 15:30Victor MerckléVictor MerckléScore: 15,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 15:3015,086132,789,982124,195,0001,021,0002,113,536
2Jun 19, 2026 15:3015,087132,803,781124,189,0001,035,0002,113,536
3Jun 19, 2026 15:3015,093132,742,920124,238,0001,042,0002,113,536
4Jun 19, 2026 15:3015,094132,816,225124,252,0001,033,0002,113,536
5Jun 19, 2026 15:3015,100132,828,930124,280,0001,054,0002,113,536
6Jun 19, 2026 15:3015,102132,882,756124,289,0001,064,0002,113,536
7Jun 19, 2026 15:3015,106132,947,771124,368,0001,018,0002,113,536
8Jun 19, 2026 15:3015,112132,929,092124,372,0001,065,0002,113,536
9Jun 19, 2026 15:3015,251134,117,665125,527,0001,060,0002,113,536