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:45stdkFeanorstdkFeanorScore: 36,911Success
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:4535,787309,076,395295,945,0001,094,0002,113,536
2Sep 22, 2026 18:4536,105310,544,180298,562,0001,111,0002,113,536
3Sep 22, 2026 18:4536,220311,070,152299,514,0001,116,0002,113,536
4Sep 22, 2026 18:4536,229311,397,357299,647,0001,059,0002,113,536
5Sep 22, 2026 18:4536,911316,855,037305,303,0001,062,0002,113,536
6Sep 22, 2026 18:4536,914317,552,148305,385,0001,005,0002,113,536
7Sep 22, 2026 18:4537,818324,362,379312,854,0001,041,0002,113,536
8Sep 22, 2026 18:4537,819324,315,725312,860,0001,045,0002,113,536
9Sep 22, 2026 18:4537,827324,602,033312,968,0001,004,0002,113,536