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 listApr 24, 2026 05:09Charles CabergsCharles CabergsScore: 19,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 05:0919,869182,091,669162,919,0001,999,0002,433,024
2Apr 24, 2026 05:0919,923179,656,888164,362,0001,002,0002,433,024
3Apr 24, 2026 05:0919,926184,607,501164,390,0001,002,0002,375,680
4Apr 24, 2026 05:0919,930186,249,768164,423,0001,002,0002,375,680
5Apr 24, 2026 05:0919,941180,535,056164,508,0001,003,0002,371,584
6Apr 24, 2026 05:0919,943180,724,681164,524,0001,003,0002,306,048
7Apr 24, 2026 05:0919,944182,036,576163,547,0001,994,0002,359,296
8Apr 24, 2026 05:0919,960187,484,270163,672,0001,996,0002,363,392
9Apr 24, 2026 05:0920,702189,510,411169,835,0001,998,0002,363,392