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 29, 2026 13:02TudyMTudyMScore: 37,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:0337,602327,856,303309,102,0003,000,0002,383,872
2Apr 29, 2026 13:0337,634327,832,371311,366,0001,001,0002,318,336
3Apr 29, 2026 13:0337,635333,087,453311,376,0001,001,0002,387,968
4Apr 29, 2026 13:0337,652329,972,121311,514,0001,001,0002,375,680
5Apr 29, 2026 13:0337,656326,801,607311,550,0001,001,0002,371,584
6Apr 29, 2026 13:0337,661327,772,106310,595,0001,997,0002,383,872
7Apr 29, 2026 13:0337,666332,612,745309,638,0002,996,0002,383,872
8Apr 29, 2026 13:0337,668331,433,392308,655,0003,995,0002,383,872
9Apr 29, 2026 13:0337,669331,629,644310,657,0001,997,0002,318,336