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 26, 2026 15:39TudyMTudyMScore: 39,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:3939,546346,167,594327,237,0001,000,0002,383,872
2Apr 26, 2026 15:3939,558347,963,142326,332,0002,002,0002,322,432
3Apr 26, 2026 15:3939,566351,878,201326,404,0002,002,0002,469,888
4Apr 26, 2026 15:3939,576341,880,992327,480,0001,001,0002,375,680
5Apr 26, 2026 15:3939,582348,034,695327,536,0001,001,0002,375,680
6Apr 26, 2026 15:3939,597345,029,892326,663,0001,997,0002,375,680
7Apr 26, 2026 15:3939,607351,909,447326,744,0001,998,0002,387,968
8Apr 26, 2026 15:3939,608348,917,599324,756,0003,997,0002,387,968
9Apr 26, 2026 15:3939,613345,127,978326,794,0001,998,0002,387,968