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 13, 2025 13:22Emanuele BolognesiEmanuele BolognesiScore: 89,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 13:2288,667764,992,929509,956,000225,980,0002,461,696
2Apr 13, 2025 13:2288,953765,916,322510,521,000227,786,0002,449,408
3Apr 13, 2025 13:2288,953769,246,575510,526,000227,788,0002,297,856
4Apr 13, 2025 13:2289,015765,216,219510,880,000227,946,0002,465,792
5Apr 13, 2025 13:2289,062765,930,125510,459,000228,757,0002,273,280
6Apr 13, 2025 13:2289,175765,110,748510,417,000229,737,0002,506,752
7Apr 13, 2025 13:2289,309770,205,980511,495,000229,773,0002,281,472
8Apr 13, 2025 13:2289,410775,197,440512,379,000229,722,0002,453,504
9Apr 13, 2025 13:2289,658768,706,700509,424,000234,734,0002,445,312