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 listMay 18, 2024 00:13richu shaji abrahamrichu shaji abrahamScore: 102,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2024 00:12102,475914,845,696850,543,96002,207,744
2May 18, 2024 00:12102,510903,946,560850,829,36002,199,552
3May 18, 2024 00:13102,580906,517,528851,416,48402,207,744
4May 18, 2024 00:13102,632915,456,718851,843,96102,199,552
5May 18, 2024 00:12102,640912,962,483851,915,76502,224,128
6May 18, 2024 00:13102,701917,478,514852,414,92002,211,840
7May 18, 2024 00:13102,709910,766,062852,487,96102,207,744
8May 18, 2024 00:13102,711937,791,414852,504,55302,203,648
9May 18, 2024 00:13102,746910,145,008852,795,64802,207,744