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 28, 2026 09:11TudyMTudyMScore: 36,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:1136,872324,432,640304,038,0002,000,0002,387,968
2Apr 28, 2026 09:1136,882324,552,819305,127,0001,000,0002,318,336
3Apr 28, 2026 09:1136,882323,267,748305,126,0001,000,0002,306,048
4Apr 28, 2026 09:1136,894329,246,459303,225,0003,002,0002,383,872
5Apr 28, 2026 09:1136,898324,589,753305,258,0001,000,0002,478,080
6Apr 28, 2026 09:1136,900328,417,733305,276,0001,000,0002,375,680
7Apr 28, 2026 09:1136,905325,577,191305,316,0001,001,0002,387,968
8Apr 28, 2026 09:1136,920327,004,476305,439,0001,001,0002,387,968
9Apr 28, 2026 09:1136,921319,145,481305,450,0001,001,0002,322,432