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 listOct 16, 2024 08:18Elnur RakhmatullinElnur RakhmatullinScore: 48,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 08:1848,698431,409,549402,193,0002,000,0002,265,088
2Oct 16, 2024 08:1848,715429,607,331403,337,0001,000,0002,273,280
3Oct 16, 2024 08:1848,723430,600,803403,402,0001,000,0002,387,968
4Oct 16, 2024 08:1848,728434,970,029403,441,0001,001,0002,277,376
5Oct 16, 2024 08:1848,731435,257,099402,468,0002,002,0002,277,376
6Oct 16, 2024 08:1848,734430,623,084403,491,0001,001,0002,273,280
7Oct 16, 2024 08:1848,737432,915,742402,517,0002,002,0002,273,280
8Oct 16, 2024 08:1848,744432,017,716403,575,000998,0002,277,376
9Oct 16, 2024 08:1848,749436,987,089402,616,0001,998,0002,277,376