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 7, 2024 14:56Evgeniy AsvatovEvgeniy AsvatovScore: 340,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 14:56340,2262,885,635,4162,823,872,03602,199,552
2Jan 7, 2024 14:11340,3182,880,083,1322,824,639,26002,211,840
3Jan 7, 2024 14:11340,4232,894,486,6752,825,507,51102,203,648
4Jan 7, 2024 14:56340,5272,895,442,1452,826,373,74602,203,648
5Jan 7, 2024 14:56341,1902,899,028,2052,831,876,12302,207,744
6Jan 7, 2024 14:11341,5312,898,173,1212,834,709,47602,260,992