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 10, 2026 19:14Danylo MocherniukDanylo MocherniukScore: 4,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 19:144,64161,996,02937,511,0001,013,0002,375,680
2Apr 10, 2026 19:134,65863,670,49836,624,0002,034,0002,490,368
3Apr 10, 2026 19:134,68567,312,88537,860,0001,023,0002,387,968
4Apr 10, 2026 19:134,70363,201,59236,035,0003,002,0002,383,872
5Apr 10, 2026 19:144,72764,848,57937,221,0002,011,0002,297,856
6Apr 10, 2026 19:144,84963,116,37738,236,0002,012,0002,297,856