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 listJul 27, 2024 19:53Avinash BodduAvinash BodduScore: 190,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 19:53189,7161,642,869,9691,574,644,35002,355,200
2Jul 27, 2024 19:53190,1851,642,105,6251,578,532,16002,355,200
3Jul 27, 2024 19:53193,7831,675,837,1371,608,397,67702,342,912