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 listApr 21, 2026 17:12Stefan Antoniu OpreaStefan Antoniu OpreaScore: 65,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:1465,150563,028,188537,751,0002,998,0002,527,232
2Apr 21, 2026 17:1465,168561,666,789538,903,0001,999,0002,510,848
3Apr 21, 2026 17:1465,170562,217,700537,917,0002,999,0002,519,040
4Apr 21, 2026 17:1465,171564,092,073539,928,000999,0002,510,848
5Apr 21, 2026 17:1465,173556,188,764538,937,0001,999,0002,314,240
6Apr 21, 2026 17:1465,178556,756,517537,984,0002,999,0002,355,200
7Apr 21, 2026 17:1465,180557,323,909538,995,0001,999,0002,326,528
8Apr 21, 2026 17:1465,185564,258,055539,036,0002,000,0002,314,240
9Apr 21, 2026 17:1465,239558,416,287539,486,0002,001,0002,330,624