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 listMay 5, 2026 16:32M-RochatM-RochatScore: 20,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:3220,750189,483,066171,105,0001,124,0002,486,272
2May 5, 2026 16:3220,776190,493,604171,278,0001,171,0002,465,792
3May 5, 2026 16:3220,828188,077,642171,731,0001,142,0002,453,504
4May 5, 2026 16:3220,836192,773,056171,750,0001,189,0002,457,600
5May 5, 2026 16:3220,952190,328,016172,734,0001,174,0002,473,984
6May 5, 2026 16:3221,019193,800,098173,291,0001,171,0002,465,792
7May 5, 2026 16:3221,021190,836,188173,295,0001,180,0002,465,792
8May 5, 2026 16:3221,170189,915,311174,570,0001,144,0002,457,600
9May 5, 2026 16:3222,664205,440,090186,989,0001,124,0002,473,984