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 listJun 22, 2026 11:57Omkar SinghOmkar SinghScore: 67,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 11:5867,706571,582,490502,683,00059,280,0002,113,536
2Jun 22, 2026 11:5867,757571,907,272502,283,00060,105,0002,113,536
3Jun 22, 2026 11:5867,773571,615,993502,000,00060,520,0002,113,536
4Jun 22, 2026 11:5867,780572,068,541502,136,00060,442,0002,113,536
5Jun 22, 2026 11:5867,784571,816,503502,295,00060,315,0002,113,536
6Jun 22, 2026 11:5867,844572,178,989502,008,00061,104,0002,113,536
7Jun 22, 2026 11:5868,159585,504,893504,470,00061,252,0002,113,536
8Jun 22, 2026 11:5868,222586,295,420504,136,00062,111,0002,113,536
9Jun 22, 2026 11:5868,295578,947,489504,382,00062,469,0002,113,536