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 18, 2025 13:40Rodrigo PalmeirimRodrigo PalmeirimScore: 165,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 13:40165,6971,399,901,2671,293,331,00081,957,0002,510,848
2Jan 18, 2025 13:40165,7461,403,666,8221,289,709,00085,980,0002,281,472
3Jan 18, 2025 13:40165,8861,404,162,2591,312,861,00063,993,0002,281,472
4Jan 18, 2025 13:40165,9381,403,221,3721,312,320,00064,966,0002,510,848
5Jan 18, 2025 13:40165,9571,401,804,7861,291,475,00085,965,0002,510,848
6Jan 18, 2025 13:40166,0461,401,239,4391,300,227,00077,953,0002,281,472
7Jan 18, 2025 13:40166,6391,406,787,1521,298,157,00084,944,0002,506,752
8Jan 18, 2025 13:40167,0401,407,301,6681,307,463,00078,967,0002,293,760
9Jan 18, 2025 13:40167,1681,417,907,1021,328,519,00058,978,0002,281,472