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 listAug 30, 2024 19:00Kasper KivimäkiKasper KivimäkiScore: 62,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2024 18:5962,329580,964,473517,332,94302,363,392
2Aug 30, 2024 18:5962,412574,641,913518,017,93202,248,704
3Aug 30, 2024 18:5962,467578,361,889518,479,38902,228,224
4Aug 30, 2024 19:0062,882582,646,753521,919,29402,306,048
5Aug 30, 2024 19:0062,903584,790,670522,095,25402,179,072
6Aug 30, 2024 19:0062,957590,129,270522,547,01602,179,072