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 1, 2025 15:13matsuoka-601matsuoka-601Score: 42,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2025 15:2642,252377,667,386349,693,000999,0002,297,856
2Jan 1, 2025 15:1342,253376,778,037347,706,0002,997,0002,314,240
3Jan 1, 2025 15:2642,290379,283,811350,003,0001,000,0002,310,144
4Jan 1, 2025 15:1342,292381,725,072348,023,0003,000,0002,314,240
5Jan 1, 2025 15:2642,293379,480,360348,033,0003,000,0002,318,336
6Jan 1, 2025 15:1342,318373,607,777350,239,0001,000,0002,297,856