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 listApr 20, 2025 22:41KeefeKeefeScore: 57,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 22:4157,601502,243,873477,086,0001,000,0002,265,088
2Apr 20, 2025 22:4157,649506,113,209477,485,000998,0002,531,328
3Apr 20, 2025 22:4157,683500,424,870476,773,0001,999,0002,527,232