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 listJan 12, 2025 13:54AdityaAdityaScore: 106,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 13:54105,240897,356,826808,529,00064,962,0002,273,280
2Jan 12, 2025 13:54105,688905,938,058807,194,00070,016,0002,379,776
3Jan 12, 2025 13:54105,727896,986,652817,568,00059,968,0002,273,280
4Jan 12, 2025 13:54106,163908,292,655815,143,00066,011,0002,392,064
5Jan 12, 2025 13:54106,266910,767,764807,010,00075,000,0002,273,280
6Jan 12, 2025 13:54106,597912,817,282822,772,00061,982,0002,379,776