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 listNov 13, 2024 15:35DanusanDanusanScore: 302,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 15:35301,5242,540,106,7672,135,994,000366,655,0002,449,408
2Nov 13, 2024 15:35301,5922,541,762,1152,141,616,000361,597,0002,445,312
3Nov 13, 2024 15:35301,8792,538,805,8742,145,939,000359,654,0002,539,520
4Nov 13, 2024 15:35302,2262,546,368,4112,132,854,000375,622,0002,445,312
5Nov 13, 2024 15:35302,2372,547,470,9032,128,480,000380,085,0002,490,368
6Nov 13, 2024 15:35302,2912,551,095,8582,166,422,000342,592,0002,433,024
7Nov 13, 2024 15:35302,7562,551,794,3552,167,168,000345,707,0002,453,504
8Nov 13, 2024 15:35302,7632,549,299,1212,147,523,000365,408,0002,461,696
9Nov 13, 2024 15:35303,3052,562,746,7702,154,944,000362,485,0002,441,216