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 23, 2025 03:53eui hyeon kimeui hyeon kimScore: 231,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 03:53231,1751,945,133,6261,859,795,00058,961,0002,269,184
2Jan 23, 2025 03:53231,2411,943,844,4381,838,333,00080,970,0002,277,376
3Jan 23, 2025 03:53231,2611,947,773,5141,851,486,00067,981,0002,523,136
4Jan 23, 2025 03:53231,2621,942,681,3021,854,490,00064,982,0002,273,280
5Jan 23, 2025 03:53231,3041,944,002,1041,837,872,00081,949,0002,277,376
6Jan 23, 2025 03:53231,3391,946,108,4551,852,146,00067,968,0002,277,376
7Jan 23, 2025 03:53231,3431,949,571,6061,857,178,00062,972,0002,281,472
8Jan 23, 2025 03:53270,1802,273,174,5912,183,509,00058,986,0002,277,376
9Jan 23, 2025 03:53273,4762,298,809,8552,199,884,00069,964,0002,277,376