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 2, 2025 13:37scompa18scompa18Score: 82,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 13:3882,360706,857,833463,718,000219,866,0002,523,136
2Jan 2, 2025 13:3882,508719,199,372464,877,000219,942,0002,322,432
3Jan 2, 2025 13:3782,530710,302,588464,320,000220,677,0002,453,504
4Jan 2, 2025 13:3782,583712,651,689461,623,000223,817,0002,433,024
5Jan 2, 2025 13:3782,680709,984,920462,490,000223,753,0002,449,408
6Jan 2, 2025 13:3882,886714,005,237465,292,000222,661,0002,482,176