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 listSep 22, 2026 18:11stdkFeanorstdkFeanorScore: 57,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2026 18:1156,468479,874,454467,649,0001,043,0002,113,536
2Sep 22, 2026 18:1156,476479,809,352467,702,0001,051,0002,113,536
3Sep 22, 2026 18:1156,488481,385,265467,799,0001,052,0002,113,536
4Sep 22, 2026 18:1157,440487,935,002475,680,0001,075,0002,113,536
5Sep 22, 2026 18:1157,560488,895,660476,749,0001,006,0002,113,536
6Sep 22, 2026 18:1158,076493,255,242481,031,0001,004,0002,113,536
7Sep 22, 2026 18:1158,103493,461,329481,175,0001,088,0002,113,536
8Sep 22, 2026 18:1158,110493,646,198481,315,0001,001,0002,113,536
9Sep 22, 2026 18:1158,122493,682,378481,306,0001,114,0002,113,536