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 3, 2025 15:35Rohan KapurRohan KapurScore: 94,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 15:3594,425804,976,230664,770,000118,959,0002,342,912
2Jan 3, 2025 15:3594,578809,567,135673,999,000110,999,0002,506,752
3Jan 3, 2025 15:3594,736817,603,410665,415,000120,893,0002,355,200