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 10, 2026 02:05Josu San MartinJosu San MartinScore: 4,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:054,64055,835,68137,432,0001,086,0002,482,176
2May 10, 2026 02:054,64859,791,46637,477,0001,105,0002,478,080
3May 10, 2026 02:054,70052,558,12537,925,0001,086,0002,453,504
4May 10, 2026 02:054,70955,943,59037,996,0001,095,0002,478,080
5May 10, 2026 02:054,72453,132,53938,131,0001,081,0002,469,888
6May 10, 2026 02:054,73052,977,49738,096,0001,165,0002,465,792
7May 10, 2026 02:054,74455,652,52638,305,0001,076,0002,469,888
8May 10, 2026 02:054,75954,364,62238,428,0001,075,0002,473,984
9May 10, 2026 02:054,80353,975,53038,708,0001,164,0002,478,080