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 listOct 15, 2026 20:33e1011e1011Score: 58,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:4158,506496,581,033426,743,00058,863,00020,480
2Oct 15, 2026 20:4158,544497,214,933426,837,00059,079,00020,480
3Oct 15, 2026 20:4158,545496,639,862427,284,00058,647,00020,480
4Oct 15, 2026 20:4158,588497,783,576426,400,00059,883,00020,480
5Oct 15, 2026 20:4158,595497,645,068426,568,00059,773,00020,480
6Oct 15, 2026 20:4158,628507,505,009426,828,00059,785,00020,480
7Oct 15, 2026 20:4158,630498,068,683427,075,00059,559,00020,480
8Oct 15, 2026 20:4158,754498,345,096426,453,00061,212,0002,113,536
9Oct 15, 2026 20:4158,826499,096,124426,459,00061,805,00020,480