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 listMay 11, 2026 16:27Josu San MartinJosu San MartinScore: 3,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:273,84740,893,05030,911,0001,026,0002,113,536
2May 11, 2026 16:273,86241,677,70331,051,0001,004,0002,113,536
3May 11, 2026 16:273,86741,169,08831,077,0001,021,0002,113,536
4May 11, 2026 16:273,88041,359,36731,133,0001,076,0002,113,536
5May 11, 2026 16:273,88640,452,22731,167,0001,094,0002,113,536
6May 11, 2026 16:273,88739,608,07431,215,0001,053,0002,113,536
7May 11, 2026 16:273,89541,749,60031,252,0001,079,0002,113,536
8May 11, 2026 16:273,89841,139,14431,339,0001,018,0002,113,536
9May 11, 2026 16:273,90841,834,35831,373,0001,068,0002,113,536